Densest Packing of Equal Circles Inthe Hyperbolic
نویسنده
چکیده
We propose a deenition of density for packings of circles of xed radius in the hyperbolic plane, and prove that for all but countably many radii, optimally dense packings must have low symmetry.
منابع مشابه
The Dense Packing of 13 Congruent Circles in a Circle
The densest packings of n congruent circles in a circle are known for n 12 and n = 19. In this paper we exhibit the densest packings of 13 congruent circles in a circle. We show that the optimal con gurations are identical to Kravitz's [11] conjecture. We use a technique developed from a method of Bateman and Erd}os [1] which proved fruitful in investigating the cases n = 12 and 19 by the autho...
متن کاملDensest Packing of Equal Spheres in Hyperbolic Space
We propose a method to analyze the density of packings of spheres of fixed radius in the hyperbolic space of any dimension m ≥ 2, and prove that for all but countably many radii, optimally dense packings must have low symmetry.
متن کاملOptimal Substructures in Optimal and Approximate Circle Packings
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the density of optimal circle packings have given. Several known optimal and approximate circle packings contain optimal substructures. Based on this observation it is sometimes easy to determine the minimal polynomials of the arrangements.
متن کاملA better packing of ten equal circles in a square
Let S be a square of side s in the Euclidean plane. A pucking of circles in S is nothing else but a finite family of circular disks included in S whose interiors are pairwise disjoints. A natural problem related with such packings is the description of the densest ones; in particular, what is the greatest value of the common radius r of n circles forming a packing of S? Clearly, the centres of ...
متن کاملDense Packing of Equal Circles on a Sphere by the Minimum-Zenith Method: Symmetrical Arrangement
Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Minimum-Zenith Method (MZM), is proposed in this report. Started from a proper initial configuration, a circle is sequentially packed one by one so that the zenith angle is as small as possible. It is necessary to fix the size of the circle and some initial configuration. Circle configurations we examined ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000